Finite Dimensional Approximation of Convex Regularization via Hexagonal Pixel Grids
نویسندگان
چکیده
This work extends the existing convergence analysis for discrete approximations of minimizers of convex regularization functionals. In particular, some solution concepts are generalized, namely the standard minimum norm solutions for squared norm regularizers and the R-minimizing solutions for general convex regularizers, respectively. A central part of the work addresses finite dimensional approximations of solutions of ill-posed operator equations with basis functions defined on hexagonal grids, which require the novel solution concept.
منابع مشابه
Optimum Shape Design of a Radiant Oven by the Conjugate Gradient Method and a Grid Regularization Approach
This study presents an optimization problem for shape design of a 2-D radiant enclosure with transparent medium and gray-diffuse surfaces. The aim of the design problem is to find the optimum geometry of a radiant enclosure from the knowledge of temperature and heat flux over some parts of boundary surface, namely the design surface. The solution of radiative heat transfer is based on the net r...
متن کاملRegularization Inertial Proximal Point Algorithm for Convex Feasibility Problems in Banach Spaces
Abstract The purpose of this paper is to give a regularization variant of the inertial proximal point algorithm not only in an infinite-dimensional Banach space E, which is an uniformly smooth and uniformly convex, but also in its finite-dimensional approximations for finding a point in the nonempty intersection ∩i=1Ci, where N ≥ 1 is an integer and each Ci is assumed to be the fixed point set ...
متن کاملA Mass Conservative Method for Numerical Modeling of Axisymmetric flow
In this paper, the cell-centered finite volume method (CC-FVM) has been presented to simulate the axisymmetric radial flow toward a pumping well. The model is applied to the unstructured triangular grids which allows to simulate inhomogeneous and complex-shaped domains. Due to the non-orthogonality of the irregular grids, the multipoint flux approximation (MPFA) methods are used to discretize t...
متن کاملHexagonal vs. Rectilinear Grids for Explicit Finite Difference Schemes for the Two-dimensional Wave Equation
Finite difference schemes for the 2-D wave equation operating on hexagonal grids and the accompanying numerical dispersion properties have received little attention in comparison to schemes operating on rectilinear grids. This paper considers the hexagonal tiling of the wavenumber plane in order to show that the hexagonal grid is a more natural choice to emulate the isotropy of the Laplacian op...
متن کاملRobust Face Recognition via Sparse Representation
In this project, we implement a robust face recognition system via sparse representation and convex optimization. We treat each test sample as sparse linear combination of training samples, and get the sparse solution via L1-minimization. We also explore the group sparseness (L2-norm) as well as normal L1-norm regularization.We discuss the role of feature extraction and classification robustnes...
متن کامل